Geodetic Number and Geo-Chromatic Number of 2-Cartesian Product of Some Graphs
نویسندگان
چکیده
A set S ⊆ V (G) is called a geodetic if every vertex of G lies on shortest u-v path for some u, v ∈ S, the minimum cardinality among all sets number and denoted by . C chromatic contains vertices different colors in G, geo-chromatic Sc both set. The G. In this paper, we determine 2-cartesian product standard graphs like complete graphs, cycles paths.
منابع مشابه
Game Chromatic Number of Cartesian Product Graphs
The game chromatic number χg is considered for the Cartesian product G 2 H of two graphs G and H. We determine exact values of χg(G2H) when G and H belong to certain classes of graphs, and show that, in general, the game chromatic number χg(G2H) is not bounded from above by a function of game chromatic numbers of graphs G and H. An analogous result is proved for the game coloring number colg(G2...
متن کاملThe edge geodetic number and Cartesian product of graphs
For a nontrivial connected graph G = (V (G), E(G)), a set S ⊆ V (G) is called an edge geodetic set of G if every edge of G is contained in a geodesic joining some pair of vertices in S. The edge geodetic number g1(G) of G is the minimum order of its edge geodetic sets. Bounds for the edge geodetic number of Cartesian product graphs are proved and improved upper bounds are determined for a speci...
متن کاملThe reliability Wiener number of cartesian product graphs
Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...
متن کاملK-tuple Chromatic Number of the Cartesian Product of Graphs
A k-tuple coloring of a graph G assigns a set of k colors to each vertex of G such that if two vertices are adjacent, the corresponding sets of colors are disjoint. The k-tuple chromatic number of G, χk(G), is the smallest t so that there is a k-tuple coloring of G using t colors. It is well known that χ(G2H) = max{χ(G), χ(H)}. In this paper, we show that there exist graphs G and H such that χk...
متن کاملChromatic Number for a Generalization of Cartesian Product Graphs
Let G be a class of graphs. A d-fold grid over G is a graph obtained from a d-dimensional rectangular grid of vertices by placing a graph from G on each of the lines parallel to one of the axes. Thus each vertex belongs to d of these subgraphs. The class of d-fold grids over G is denoted by Gd. Let f(G; d) = maxG∈Gd χ(G). If each graph in G is k-colorable, then f(G; d) ≤ kd. We show that this b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open journal of Discrete Mathematics
سال: 2022
ISSN: ['2161-7635', '2161-7643']
DOI: https://doi.org/10.4236/ojdm.2022.121001